Watershed cuts
نویسندگان
چکیده
We study the watersheds in edge-weighted graphs. Contrarily to previous works, we define the watersheds following the intuitive idea of drops of water flowing on a topographic surface. We establish the consistency (with respect to characterizations of the catchment basins and dividing lines) of these watersheds, prove their optimality (in terms of minimum spanning forests) and derive a linear-time algorithm. To the best of our knowledge, similar properties are not verified in other frameworks and the proposed algorithm is the most efficient existing algorithm.
منابع مشابه
On Watershed Cuts and Thinnings
We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisely, we introduce a new transformation, called border thinning, that lowers the values of edges that match a simple local configuration until idempotence and prove the equivalence between the cuts obtained by this transformation ...
متن کاملImplementing Interactive 3D Segmentation on CUDA Using Graph-Cuts and Watershed Transformation
In this paper we present a novel scheme for a very fast implementation of volumetric segmentation using graph cuts. The main benefit of this work is our approach to non-grid region adjacency processing on CUDA which to our knowledge has not been done yet in any efficient way. The watershed transform radically reduces the number of vertices for graph processing. Everything starting from watershe...
متن کاملSome links between min-cuts, optimal spanning forests and watersheds
Di erent optimal structures: minimum cuts, minimum spanning forests and shortest-path forests, have been used as the basis for powerful image segmentation procedures. The well-known notion of watershed also falls into this category. In this paper, we present some new results about the links which exist between these di erent approaches. Especially, we show that min-cuts coincide with watersheds...
متن کاملFast Image Blending using Watersheds and Graph Cuts
This paper presents a novel approach for combining a set of registered images into a composite mosaic with no visible seams and minimal texture distortion. To promote execution speed in building large area mosaics, the mosaic space is divided into disjoint regions of image intersection based on a geometric criterion. Pair-wise image blending is performed independently in each region by means of...
متن کاملPower Watersheds: A Unifying Graph Based Optimization Framework
In this work, we extend a common framework for graph-based image segmentation that includes the graph cuts, random walker, and shortest path optimization algorithms. Viewing an image as a weighted graph, these algorithms can be expressed by means of a common energy function with differing choices of a parameter q acting as an exponent on the differences between neighboring nodes. Introducing a ...
متن کاملRegion Merging Via Graph-Cuts
In this paper, we discuss the use of graph-cuts to merge the regions of the watershed transform optimally. Watershed is a simple, intuitive and efficient way of segmenting an image. Unfortunately it presents a few limitations such as over-segmentation and poor detection of low boundaries. Our segmentation process merges regions of the watershed over-segmentation by minimizing a specific criteri...
متن کامل